Theory of Computation
Q191.
Choose the correct alternatives (More than one may be correct).Let R_{1} and R_{1} be regular sets defined over the alphabet \Sigma Then:Q192.
Consider the following two statements: P: Every regular grammar is LL(1) Q: Every regular set has a LR(1) grammar Which of the following is TRUE?Q193.
For S \in (0+1)^{*}, let d(s) denote the decimal value of s (e.g. d(101)=5). Let L={s \in (0+1)*| d(s) mod 5=2 and d(s) mod 7\neq4} Which one of the following statements is true?Q195.
Consider the regular expression R = (a + b)^* (aa + bb) (a + b)^* Which deterministic finite automaton accepts the language represented by the regular expression R?Q196.
Which regular expression best describes the language accepted by the non-deterministic automaton below?Q197.
Which one of the following regular expressions is NOT equivalent to the regular expression (a + b + c)^*?Q198.
Consider the regular expression R = (a + b)^* \ (aa + bb) \ (a + b)^* Which one of the regular expressions given below defines the same language as defined by the regular expression R ?Q199.
Consider the following definition of a lexical token id for an identifier in a programming language, using extended regular expressions: letter \rightarrow [A-Za-z] digit \rightarrow [0-9] id \rightarrow letter (letter\;| \;digit)^* Which one of the following Non-deterministic Finite-state Automata with - transitions accepts the set of valid identifiers? (A double-circle denotes a final state)Q200.
Which of the following regular expressions represent(s) the set of all binary numbers that are divisible by three? Assume that the string \epsilon is divisible by three.[MSQ]